1

Turing Machines and the Spectra of First-Order Formulas

Year:
1974
Language:
english
File:
PDF, 1.27 MB
english, 1974
2

A survey of one-way functions in complexity theory

Year:
1992
Language:
english
File:
PDF, 1.04 MB
english, 1992
4

Arithmetical Reducibilities I

Year:
1971
Language:
english
File:
PDF, 850 KB
english, 1971
5

Arithmetical Reducibilities II

Year:
1972
Language:
english
File:
PDF, 593 KB
english, 1972
7

A taxonomy of complexity classes of functions

Year:
1994
Language:
english
File:
PDF, 1.26 MB
english, 1994
8

P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP

Year:
1979-1980
Language:
english
File:
PDF, 677 KB
english, 1979-1980
9

Promise problems complete for complexity classes

Year:
1988
Language:
english
File:
PDF, 584 KB
english, 1988
10

Analogues of semirecursive sets and effective reducibilities to the study of NP complexity

Year:
1982
Language:
english
File:
PDF, 749 KB
english, 1982
11

Polynomial Time Enumeration Reducibility

Year:
1978
Language:
english
File:
PDF, 2.15 MB
english, 1978
12

Natural Self-Reducible Sets

Year:
1988
Language:
english
File:
PDF, 1.03 MB
english, 1988
13

Complexity Theory Retrospective || Juris Hartmanis: The Beginnings of Computational Complexity

Year:
1990
Language:
english
File:
PDF, 1.70 MB
english, 1990
14

[Texts in Computer Science] Computability and Complexity Theory ||

Year:
2011
Language:
english
File:
PDF, 2.45 MB
english, 2011
16

Sets of Formulas Valid in Finite Structures

Year:
1973
Language:
english
File:
PDF, 355 KB
english, 1973
19

Relativized Halting Problems

Year:
1974
Language:
english
File:
PDF, 349 KB
english, 1974
21

EDITORS' FOREWORD

Year:
1998
Language:
english
File:
PDF, 83 KB
english, 1998
22

GUEST EDITORS' FOREWORD

Year:
1999
Language:
english
File:
PDF, 31 KB
english, 1999
23

Some observations on NP real numbers and P-selective sets

Year:
1981
Language:
english
File:
PDF, 353 KB
english, 1981
24

Editor's foreword

Year:
1982
File:
PDF, 27 KB
1982
25

Editor's foreword

Year:
1982
File:
PDF, 34 KB
1982
26

Qualitative relativizations of complexity classes

Year:
1985
Language:
english
File:
PDF, 1.18 MB
english, 1985
27

Editors' foreword

Year:
1989
File:
PDF, 40 KB
1989
28

Editors' foreword

Year:
1989
File:
PDF, 37 KB
1989
29

A second step toward the polynomial hierarchy

Year:
1979
Language:
english
File:
PDF, 972 KB
english, 1979
30

Reductions on NP and P-selective sets

Year:
1982
Language:
english
File:
PDF, 2.04 MB
english, 1982
31

Foreword

Year:
1993
File:
PDF, 30 KB
1993
32

The complexity of unions of disjoint sets

Year:
2008
Language:
english
File:
PDF, 260 KB
english, 2008
33

Canonical disjoint NP-pairs of propositional proof systems

Year:
2007
Language:
english
File:
PDF, 355 KB
english, 2007
35

A hierarchy based on output multiplicity

Year:
1998
Language:
english
File:
PDF, 1.71 MB
english, 1998
36

Complete distributional problems, hard languages, and resource-bounded measure

Year:
2000
Language:
english
File:
PDF, 118 KB
english, 2000
37

Characterizations of reduction classes modulo oracle conditions

Year:
1984
Language:
english
File:
PDF, 1.22 MB
english, 1984
38

Inclusion complete tally languages and the Hartmanis-Berman conjecture

Year:
1977-1978
Language:
english
File:
PDF, 566 KB
english, 1977-1978
39

Hard promise problems and nonuniform complexity

Year:
1993
Language:
english
File:
PDF, 850 KB
english, 1993
42

Foreword

Year:
2011
Language:
english
File:
PDF, 76 KB
english, 2011
43

Non-mitotic sets

Year:
2009
Language:
english
File:
PDF, 833 KB
english, 2009
44

Bi-immunity separates strong NP-completeness notions

Year:
2004
Language:
english
File:
PDF, 174 KB
english, 2004
45

Reductions between disjoint NP-Pairs

Year:
2005
Language:
english
File:
PDF, 298 KB
english, 2005
49

Quantitative Relativizations of Complexity Classes

Year:
1984
Language:
english
File:
PDF, 3.43 MB
english, 1984
50

Complexity Measures for Public-Key Cryptosystems

Year:
1988
Language:
english
File:
PDF, 3.59 MB
english, 1988